Optimal Holding times at Transfer Stations

نویسندگان

  • Randolph Hall
  • Maged Dessouky
  • Quan Lu
چکیده

Most bus transit systems only offer direct service between a small fraction of the origin/destination pairs that they serve. As a consequence, many travelers must transfer between bus lines to complete their journey. In this paper schedule control policies are created to minimize transfer time under stochastic conditions. We determine how long a bus should be held at a transfer stop in anticipation of the arrival of passengers from connecting bus lines. In general, the total expected waiting time function may have multiple local minima. However, we show there exists at most one non-boundary local minimum point for the special case where arrival times of connecting buses are identically and normally distributed. An application is provided based on bus lines in Los Angeles County’s Metropolitan Transportation Agency to evaluate holding time policies.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Scheduling of Connections in Railway Systems

Complex railway networks typically consist of widely diffused OD-pairs by which it is impossible to provide direct trips only. Therefore, passengers often have to change trains at transfer stations. Guaranteeing scheduled connections is complicated by delays during operation. To improve and maintain the quality of transfers requires optimal scheduling and control of connections at transfer stat...

متن کامل

Asymptotically optimal schedules for single-server flow shop problems with setup costs and times

We consider the processing of M jobs in a flow shop with N stations in which only a single server is in charge of all stations. We demonstrate that for the objective of minimizing the total setup and holding cost, a class of easily implementable schedules is asymptotically optimal. © 2004 Published by Elsevier B.V.

متن کامل

Optimal Control of Flexible Servers in Two Tandem Queues with Operating Costs

We consider two-stage tandem queuing systems with dedicated servers in each station and flexible servers that can serve in both stations. We assume exponential service times, linear holding costs, and operating costs incurred by the servers at rates proportional to their speeds. Under conditions that ensure the optimality of nonidling policies, we show that the optimal allocation of flexible se...

متن کامل

Dynamic Routing and Jockeying Controls in a Two-station Queueing System

This paper studies optimal routing and jockeying policies in a two-station parallel queueing system. It is assumed that jobs arrive to the system in a Poisson stream with rate λ and are routed to one of two parallel stations. Each station has a single server and a buffer of infinite capacity. The service times are exponential with server-dependent rates, μ1 and μ2. Jockeying between stations is...

متن کامل

Delay-Robustness of Transfer Patterns in Public Transportation Route Planning

Transfer pattern routing is a state-of-the-art speed-up technique for finding optimal paths which minimize multiple cost criteria in public transportation networks. It precomputes sequences of transfer stations along optimal paths. At query time, the optimal paths are searched among the stored transfer patterns, which allows for very fast response times even on very large networks. On the other...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005